High-Speed Decoding of the Binary Golay Code
نویسندگان
چکیده
Recently, some table-lookup decoding algorithms (TLDAs) have been used to correct the binary Golay code. This paper proposes an efficient high-speed TLDA called message-syndrome decoding algorithm (MSDA) by using the message syndrome to correct the binary systematic Golay code. The proposed MSDA is based on the novel message-syndrome lookup table (MSLT). The MSLT merely consists of 12 candidate syndromes and its memory size is significantly smaller than other existing lookup tables. Computer software simulation results show that the decoding speed of the proposed MSDA is superior to other proposed TLDAs.
منابع مشابه
The Golay Code Outperforms the Extended Golay Code Under Hard-Decision Decoding
We show that the binary Golay code is slightly more power efficient than the extended binary Golay code under maximum-likelihood (ML), hard-decision decoding. In fact, if a codeword from the extended code is transmitted, one cannot achieve a higher probability of correct decoding than by simply ignoring the 24th symbol and using an ML decoder for the non-extended code on the first 23 symbols. T...
متن کاملSymbol-by-symbol APP decoding of the Golay code and iterative decoding of concatenated Golay codes
An efficient coset based symbol-by-symbol soft-in/soft-out APP decoding algorithm is presented for the Golay code. Its application in the iterative decoding of concatenated Golay codes is examined.
متن کاملTitle Symbol-by-symbol APP decoding of the Golay code and iterative decoding of concatenated Golay codes
An efficient coset based symbol-by-symbol soft-in/soft-out APP decoding algorithm is presented for the Golay code. Its application in the iterative decoding of concatenated Golay codes is examined.
متن کاملDecoding the (23, 12, 7) Golay Code Using a Low-Complexity Scheme
Similar to algebraic decoding schemes, the (23, 12, 7) Golay code can be decoded by applying the step-by-step decoding algorithm. In this work, a modified step-by-step algorithm for decoding the Golay code is presented. Logical analysis yielded a simple rule for directly determining whether a bit in the received word is correct. The computational complexity can be reduced significantly using th...
متن کامل